Orthogonal Approximately Harmonic Projection for Face Recognition
نویسندگان
چکیده
Face recognition has attracted growing attention for applications such as identity authentication and human-computer interface. However, a major challenge of face recognition is that the captured face image often lies in a high-dimensional feature space. To overcome the curse of dimensionality problem and improve the performance of face recognition, a novel manifold learning algorithm called orthogonal approximately harmonic projection (OMMP) is proposed in this paper. The OAHP algorithm is based on the harmonic projection (AHP) and explicitly considers the local geometrical structure and cluster structure of the face space. Meanwhile, the OAHP method can produce orthogonal basis vectors to preserve the metric structure of face space, which greatly enhances the discriminating power of the reduced lower-dimensional feature space. Experimental results on three face databases show that the proposed OAHP performs much better than related algorithms in terms of recognition rate.
منابع مشابه
Two-dimensional approximately harmonic projection for gait recognition
This paper presents a two-dimensional approximately harmonic projection (2DAHP) algorithm for gait recognition. 2DAHP is originated from the approximately harmonic projection (AHP), while 2DAHP offers some advantages over AHP. 1) 2DAHP can preserve the local geometrical structure and cluster structure of image data as AHP. 2) 2DAHP encodes images as matrices or second-order tensors rather than ...
متن کاملOrthogonal Maximum Margin Projection for Face Recognition
Dimensionality reduction techniques that can introduce low-dimensional feature representation with enhanced discriminatory power are of paramount importance in face recognition. In this paper, a novel subspace learning algorithm called orthogonal maximum margin projection(OMMP) is proposed. The OMMP algorithm is based on the maximum margin projection (MMP), which aims at discovering both geomet...
متن کاملOrthogonal Projection Pursuit Using Genetic Optimization
Projection pursuit is concerned with finding interesting lowdimensional subspace of multivariate data. In this paper we proposed a genetic optimization approach to find the globally optimal orthogonal subspace given training data and user defined criterion on what subspaces are interesting. We then applied this approach to human face recognition. Suppose face recognition is done by simple corre...
متن کاملSupervised feature extraction based on orthogonal discriminant projection
In this paper, a supervised feature extraction method, named orthogonal discriminant projection (ODP), is presented. As an extension of spectral mapping method, the proposed algorithm maximizes the weighted difference between the non-local scatter and the local scatter. Moreover, the weights between two nodes of a graph are adjusted according to their class information and local information. Ex...
متن کاملFace Recognition Based on Mutual Projection of Feature Distributions
This paper proposes a new face recognition method based on mutual projection of feature distributions. The proposed method introduces a new robust measurement between two feature distributions. This measurement is computed by a harmonic mean of two distance values obtained by projection of each mean value into the opposite feature distribution. The proposed method does not require eigenvalue an...
متن کامل